Facets for continuous multi-mixing set with general coefficients and bounded integer variables
نویسندگان
چکیده
منابع مشابه
Facets for continuous multi-mixing set with general coefficients and bounded integer variables
Bansal and Kianfar introduced continuous multi-mixing set where the coefficients satisfy the so-called n-step MIR conditions and developed facet-defining inequalities for this set. In this paper, we first generalize their inequalities for the continuous multi-mixing set with general coefficients (where no conditions are imposed on the coefficients) and show that they are facetdefining in many c...
متن کاملn-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem
In this paper, we introduce a generalization of the continuous mixing set (which we refer to as the continuous n-mixing set) Qm,n := {(y, v, s) ∈ ( Z× Zn−1 + )m×Rm+1 + : ∑nt=1 αty t + vi + s ≥ βi, i = 1, . . . ,m}. This set is closely related to the feasible set of the multi-module capacitated lot-sizing (MML) problem with(out) backlogging. For each n′ ∈ {1, . . . , n}, we develop a class of va...
متن کاملCutting planes for integer programs with general integer variables
We investigate the use of cutting planes for integer programs with general integer variables. We show how cutting planes arising from knapsack inequalities can be generated and lifted as in the case of 0{1 variables. We also explore the use of Gomory's mixed integer cuts. We address both theoretical and computational issues and show how to embed these cutting planes in a branch-and-bound framew...
متن کاملParameterized Integer Quadratic Programming: Variables and Coefficients
In the Integer Quadratic Programming problem input is an n× n integer matrix Q, an m × n integer matrix A and an m-dimensional integer vector b. The task is to find a vector x ∈ Z minimizing xQx, subject to Ax ≤ b. We give a fixed parameter tractable algorithm for Integer Quadratic Programming parameterized by n+α. Here α is the largest absolute value of an entry of Q and A. As an application o...
متن کاملOn the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
In this paper we consider an infinite relaxation of the mixed integer linear program with two integer variables, nonnegative continuous variables and two equality constraints, and we give a complete characterization of its facets. We also derive an analogous characterization of the facets of the underlying finite integer program.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2017
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2017.05.002